Normalization as a homomorphic image of cut-elimination
نویسندگان
چکیده
منابع مشابه
Normalization as a Consequence of Cut Elimination
Pairs of systems, which consist of a system of sequents and a natural deduction system for some part of intuitionistic logic, are considered. For each of these pairs of systems the property that the normalization theorem is a consequence of the cut-elimination theorem is presented.
متن کاملCorrespondence between Normalization of CND and Cut-Elimination of LKT
We study the correspondence between normalization of two well-known constructive classical logic, namely CND (Parigot 92) and LKT (Danos-Joinet-Schellinx 93). For this, we develop term calculi. We then show translation from CND to LKT and show the simulation theorem; the normalization of CND can be simulated by cut-elimination of LKT. Furthermore, we argue that the translation can be considered...
متن کاملPattern Matching as Cut Elimination
We present a typed pattern calculus with explicit pattern matching and explicit substitutions, where both the typing rules and the reduction rules are modeled on the same logical proof system, namely Gentzen sequent calculus for minimal logic. Our calculus is inspired by the Curry-Howard Isomorphism, in the sense that types, both for patterns and terms, correspond to propositions, terms corresp...
متن کاملSupplement to “ Dead - End Elimination as a Heuristic for Min - Cut Image Segmentation ”
This article is a supplement to our 2006 ICIP paper, “Dead-End Elimination as a Heuristic for Min-Cut Image Segmentation” [1], which we assume the reader has read. We summarize the proof of the dead-end elimination theorem (due to Desmet et al. [2] and Goldstein [3]), briefly discuss the performance of our current implementation of DEE pairs, show the input images for which timings are referenc...
متن کاملClassical Proofs as Programs, Cut Elimination as Computation
We show that the SN and CR cut-elimination procedure on Gentzen-style classical logic LKT/LKQ, as presented in Danos et al.(1994), is isomorphic to call-by-name (CBN) and call-by-value (CBV) reduction system respectively. Our method is simple. We assign typed -terms on intuitionistic decoration of LKT/LKQ so as to simulate the cut-elimination procedure by -contraction | i.e. we simulate cutelim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematical Logic
سال: 1977
ISSN: 0003-4843
DOI: 10.1016/s0003-4843(77)80004-1